Families of convex sets not representable by points
نویسندگان
چکیده
Let (A,B,C) be a triple of disjoint closed convex sets in the plane such that each of them contributes at least one point to the boundary ∂ of the convex hull of their union. If there are three points a ∈ A, b ∈ B, c ∈ C that belong to ∂ and follow each other in clockwise (counterclockwise) order, we say that the orientation of the triple (A,B,C) is clockwise (counterclockwise). We construct families of disjoint closed convex sets {C1, . . . , Cn} in the plane whose every triple has a unique orientation, but there are no points p1, . . . , pn in general position in the plane whose triples have the same orientations. In other words, these families cannot be represented by a point set of the same order type. This answers a question of A. Hubard and L. Montejano. We also show the size of the largest subfamily representable by points, which can be found in any family of n disjoint closed convex sets in general position in the plane, is O(n 8/ log ). Some related Ramsey-type geometric problems are also discussed.
منابع مشابه
Regularity in mixed-integer convex representability
Characterizations of the sets with mixed integer programming (MIP) formulations using only rational linear inequalities (rational MILP representable) and those with formulations that use arbitrary closed convex constraints (MICP representable) were given by Jeroslow and Lowe (1984), and Lubin, Zadik and Vielma (2017). The latter also showed that even MICP representable subsets of the natural nu...
متن کاملD-representability of Simplicial Complexes of Fixed Dimension
Let K be a simplicial complex with vertex set V = {v1, . . . , vn}. The complex K is d-representable if there is a collection {C1, . . . , Cn} of convex sets in R d such that any subcollection {Ci1 , . . . , Cij} has a nonempty intersection if and only if {vi1 , . . . , vij} is a face of K. In 1967 Wegner proved that every simplicial complex of dimension d is (2d + 1)representable. He also conj...
متن کاملOn Order Types of Systems of Segments in the Plane
Let r(n) denote the largest integer such that every family C of n pairwise disjoint segments in the plane in general position has r(n) members whose order type can be represented by points. Pach and Tóth gave a construction that shows r(n) < n 8/ log 9 [11]. They also stated that one can apply the Erdős-Szekeres theorem for convex sets in [10] to obtain r(n) > log16 n. In this note, we will sho...
متن کاملSufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets
Abstract. A set S ⊆ R is called to be Semidefinite (SDP) representable if S equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). Clearly, if S is SDP representable, then S must be convex and semialgebraic (it is describable by conjunctions and disjunctions of polynomial equalities or inequalities). This paper proves sufficient c...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کامل